Polygonization of implicit surfaces
نویسنده
چکیده
This paper discusses a numerical technique that approximates an implicit surface with a polygonal representation. The implicit function is adaptively sampled as it is surrounded by a spatial partitioning. The partitioning is represented by an octree, which may either converge to the surface or track it. A piecewise polygonal representation is derived from the octree. The technique is insensitive to the complexity of the implicit function, allowing the designer great latitude. With a polygonal representation of the surface available, certain computational economies result. In particular, the roots to the function need not be solved each time the surface is rendered. CR
منابع مشابه
Dynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features
The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
متن کاملON ESCHER’S SPIRALS Polygonization of 2-manifolds with boundaries
An algorithm of polygonization of trimmed implicit surfaces yielding surface sheets is presented. These twodimensional manifolds with boundaries result from the set-theoretic difference of an implicit surface and a solid. The algorithm generates the polygonal approximation of the trimmed surface with the mesh adaptation to the manifold boundary.
متن کاملSimple and E cient Polygonization of Implicit Surfaces
his paper describes a simple and e cient polygonization algorithm that gives a practical way to construct adapted piecewise linear representations of implicit surfaces. The method starts with a coarse uniform polygonal approximation of the surface and subdivides each polygon recursively according to local curvature. In that way, the inherent complexity of the problem is tamed by separating stru...
متن کاملAdaptive Implicit Surface Polygonization Using Marching Triangles
This paper presents several improvements to the marching triangles algorithm for general implicit surfaces. The original method generates equilateral triangles of constant size almost everywhere on the surface. We present several modifications to adapt the size of the triangles to the curvature of the surface. As cracks may arise in the resulting polygonization, we propose a specific crack-clos...
متن کاملSubdivision Surfaces for Fast Approximate Implicit Polygonization
We propose a fast method of generating an approximate polygonal mesh from an implicit surface. Current workstations are still not capable of producing polygon meshes fast enough for the interactive modelling of complex implicit models. We propose a hybrid method that combines current implicit polygonization techniques with the faster sub-division surface technique applied as a post-process to s...
متن کاملEdge spinning algorithm for implicit surfaces ✩
This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 5 شماره
صفحات -
تاریخ انتشار 1988